منابع مشابه
Automatic semigroups vs automaton semigroups
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...
متن کاملFinite semigroups as categories, ordered semigroups or compact semigroups
The results presented in this section are a good illustration of the following quotation of Marshall Stone [34]: ’A cardinal principle of modern mathematical research may be stated as a maxim: “One must always topologize” ’. Varieties of finite semigroups are a good example where Stone’s principle was applied successfully. Recall that a variety of semigroups is a class of semigroups closed unde...
متن کاملBinomial Sampling and the Binomial Distribution
This is a good place to point out that these are only (approximating) , and not full truth. models Truth is not a model. A model, by definition, is an approximation (and not truth). In fact, out of a few million coin flips, one or more coins will remain standing on edge – that is truth. The binomial model does not allow such reality. The idea is more easily understood for the outcomes “dead" or...
متن کاملChain binomial models and binomial autoregressive processes.
We establish a connection between a class of chain-binomial models of use in ecology and epidemiology and binomial autoregressive (AR) processes. New results are obtained for the latter, including expressions for the lag-conditional distribution and related quantities. We focus on two types of chain-binomial model, extinction-colonization and colonization-extinction models, and present two appr...
متن کاملBinomial Heaps and Skew Binomial Heaps
We implement and prove correct binomial heaps and skew binomial heaps. Both are data-structures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the deleteMin-operation is logarithmic. This is achieved by using skew links to avoid cascading linking on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1998
ISSN: 0021-8693
DOI: 10.1006/jabr.1997.7292